A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth
نویسندگان
چکیده
The cutwidth of a graph G is defined to be the smallest integer k such that the vertices of G can be arranged in a vertex ordering [v1, . . . , vn] in a way that, for every i = 1, . . . , n−1, there are at most k edges with the one endpoint in {v1, . . . , vi} and the other in {vi+1, . . . , vn}. We examine the problem of computing in polynomial time the cutwidth of a partial w-tree with bounded degree. In particular, we show how to construct an algorithm that, in nO(w 2d) steps, computes the cutwidth of any partial w-tree with vertices of degree bounded by a fixed constant d. Our algorithm is constructive in the sense that it can be adapted to output the corresponding optimal vertex ordering. Also, it is the main subroutine of an algorithm computing the pathwidth of a bounded degree partial w-tree in nO((wd) 2) steps.
منابع مشابه
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, nontrivial polynomial-time cutwidth algorithms were known only for subclasses of graphs of bounded treewidth. Very recently, Heggernes et al. (SIAM J. Discrete Math., 25 (2011), pp. 1418–1437) initiated the study of cutwidth on gra...
متن کاملDegree-3 Treewidth Sparsifiers
We study treewidth sparsifiers. Informally, given a graph G of treewidth k, a treewidth sparsifier H is a minor of G, whose treewidth is close to k, |V (H)| is small, and the maximum vertex degree in H is bounded. Treewidth sparsifiers of degree 3 are of particular interest, as routing on node-disjoint paths, and computing minors seems easier in sub-cubic graphs than in general graphs. In this ...
متن کاملTreewidth for Graphs with Small Chordality
A graph G is k-chordal, if it does not contain chordless cycles of length larger than k. The chordality Ic of a graph G is the minimum k for which G is k-chordal. The degeneracy or the width of a graph is the maximum min-degree of any of its subgraphs. Our results are the following: ( 1) The problem of treewidth remains NP-complete when restricted to graphs with small maximum degree. (2) An upp...
متن کاملDegree-constrained decompositions of graphs: Bounded treewidth and planarity
We study the problem of decomposing the vertex set V of a graph into two nonempty parts V1, V2 which induce subgraphs where each vertex v ∈ V1 has degree at least a(v) inside V1 and each v ∈ V2 has degree at least b(v) inside V2. We give a polynomialtime algorithm for graphs with bounded treewidth which decides if a graph admits a decomposition, and gives such a decomposition if it exists. This...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001